#include <iostream>
using namespace std;

// 递归计算斐波那契数列的函数
int fibonacci(int n)
{
    if (n <= 1)
    {
        return n;
    }
    return fibonacci(n - 1) + fibonacci(n - 2);
}

int main()
{
    int n = 9;
    int result = fibonacci(n);
    cout << "斐波那契数列第 " << n << " 项为: " << result << endl;

    return 0;
}